package DataStructureAndAlgorithm.AcWing_每日一题.模拟;
import java.util.Scanner;
//链接：https://www.acwing.com/problem/content/3802/
public class AcWing_3799 {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int k = 0; k < t; k ++){
            int a = in.nextInt();
            int b = in.nextInt();
            boolean flag = false;
            int cnt = 1;
            while (a >= 0 && b >= 0){
                //如果轮到Vladik
                if (!flag){
                    a -= cnt;
                    cnt++;
                    flag = true;
                }else {
                    b -= cnt;
                    cnt++;
                    flag = false;
                }
            }
            if (a < 0)System.out.println("Vladik");
            else System.out.println("Valera");
        }
        in.close();
    }
}
